Variable Metric Conjugate Gradient Methods
نویسندگان
چکیده
منابع مشابه
On Variable - Metric Methods for Sparse Hessians
The relationship between variable-metric methods derived by norm minimization and those derived by symmetrization of rank-one updates for sparse systems is studied, and an analogue of Dennis's nonsparse symmetrization formula derived. A new method of using norm minimization to produce a sparse analogue of any nonsparse variable-metric method is proposed. The sparse BFGS generated by this method...
متن کاملProblems of Unconstrained Optimization
In this paper we give an review on convergence problems of un-constrained optimization algorithms, including line search algorithms and trust region algorithms. Recent results on convergence of conjugate gradient methods are discussed. Some well-known convergence problems of variable metric methods and recent eeorts made on these problems are also presented.
متن کاملSimilarity Metric Learning for a Variable-kernel Classiier
Nearest-neighbour interpolation algorithms have many useful properties for applications to learning, but they often exhibit poor generalization. In this paper, it is shown that much better generalization can be obtained by using a variable interpolation kernel in combination with conjugate gradient optimization of the similarity metric and kernel size. The resulting method is called variable-ke...
متن کاملSimilarity Metric Learning for aVariable - Kernel Classi
Nearest-neighbour interpolation algorithms have many useful properties for applications to learning, but they often exhibit poor generalization. In this paper, it is shown that much better generalization can be obtained by using a variable interpolation kernel in combination with conjugate gradient optimization of the similarity metric and kernel size. The resulting method is called variable-ke...
متن کاملA Combined Variable Metric - Conjugate Gradient Algorithm for a Class of Large Scale Unconstrained Minimization Problems
An algorithm is being presented for a special class of unconstrained minimization problems. The algorithm exploits the special structure of the Hessian in the problems under consideration, It is based on applying Bertsekas' I-1] Scaled Partial Conjugate Gradient method with respect to a metric that is updated by the Rank One update, using gradients obtained in the preceeding steps. Two classes ...
متن کامل